Subdifferential Stability Analysis for Convex Optimization Problems via Multiplier Sets
نویسندگان
چکیده
منابع مشابه
Convex Optimization For Non-Convex Problems via Column Generation
We apply column generation to approximating complex structured objects via a set of primitive structured objects under either the cross entropy or L2 loss. We use L1 regularization to encourage the use of few structured primitive objects. We attack approximation using convex optimization over an infinite number of variables each corresponding to a primitive structured object that are generated ...
متن کاملVector Optimization Problems via Improvement Sets
Motivated by applications to the real world, various optimality criteria (also approximate ones) are developed for situations in vector optimization. We propose a new type of solution based on upper comprehensive sets and we discuss the existence of optimal points in multicriteria situations.
متن کاملNew results in subdifferential calculus with applications to convex optimization
Chain and addition rules of subdifferential calculus are revisited in the paper and new proofs, providing local necessary and sufficient conditions for their validity, are presented. A new product rule pertaining to the composition of a convex functional and a Young function is also established and applied to obtain a proof of Kuhn-Tucker conditions in convex optimization under minimal assumpti...
متن کاملDuality for almost convex optimization problems via the perturbation approach
We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we ...
متن کاملThe Bilinear Multiplier Problem for Strictly Convex Compact Sets
We study the question whether characteristic functions of strictly convex compact sets with smooth boundaries in R are L × L → L bounded bilinear Fourier multiplier operators on R × R. When n ≥ 2 we answer this question in the negative outside the local L case, i.e., when 1/p + 1/q = 1/r and 2 ≤ p, q, r′ <∞ fails. Our proof is based on a suitable adaptation of the Kakeya type construction emplo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Mathematics
سال: 2018
ISSN: 2305-221X,2305-2228
DOI: 10.1007/s10013-018-0287-x